翻訳と辞書 Words near each other ・ Lee David Zlotoff ・ Lee Davidson ・ Lee Davies ・ Lee Davis ・ Lee de Broux ・ Lee de Forest ・ Lee Delano ・ Lee Demarbre ・ Lee DeMontreville ・ Lee Denney ・ Lee Deok-hwa ・ Lee DeRamus ・ Lee Deuk-choon ・ Lee DeWyze ・ Lee Dickson ・ Lee distance ・ Lee District (Metropolis) ・ Lee Dixon ・ Lee Dixon (actor) ・ Lee Do-hui ・ Lee Do-kweon ・ Lee Do-sung ・ Lee Dobyns ・ Lee Doherty ・ Lee Don-ku ・ Lee Don-ku (director) ・ Lee Donaldson ・ Lee Dong-geun (footballer, born 1981) ・ Lee Dong-geun (footballer, born 1988) ・ Lee Dong-gook Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Lee distance ： ウィキペディア英語版 Lee distance In coding theory, the Lee distance is a distance between two strings $x\_1\; x\_2\; \backslash dots\; x\_n$ and $y\_1\; y\_2\; \backslash dots\; y\_n$ of equal length ''n'' over the ''q''-ary alphabet of size ''q'' ≥ 2. It is a metric, defined as : $\backslash sum\_^n\; \backslash min(|x\_i-y\_i|,q-|x\_i-y\_i|).$〔 Considering the alphabet as the additive group Z''q'', the Lee distance between two letters is the length of shortest path in the Cayley graph (which is circular since the group is cyclic) between them. If ''q'' = 2 or ''q'' = 3 the Lee distance coincides with the Hamming distance. The metric space induced by the Lee distance is a discrete analog of the elliptic space. ==Example== If ''q'' = 6, then the Lee distance between 3140 and 2543 is 1 + 2 + 0 + 3 = 6. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Lee distance」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.